Bounds via spectral radius-preserving row sum expansions
نویسندگان
چکیده
We show a simple method for constructing larger dimension nonnegative matrices with somewhat arbitrary entries which can be irreducible or reducible but preserving the spectral radius via row sum expansions. This yields sufficient criteria two square of to have same radius, way compare radii matrices, and derive new upper lower bounds on give standard as special case.
منابع مشابه
Sharp Bounds on the PI Spectral Radius
In this paper some upper and lower bounds for the greatest eigenvalues of the PI and vertex PI matrices of a graph G are obtained. Those graphs for which these bounds are best possible are characterized.
متن کاملsharp bounds on the pi spectral radius
in this paper some upper and lower bounds for the greatest eigenvalues of the pi and vertex pimatrices of a graph g are obtained. those graphs for which these bounds are best possible arecharacterized.
متن کاملLinear Maps Preserving Invertibility or Spectral Radius on Some $C^{*}$-algebras
Let $A$ be a unital $C^{*}$-algebra which has a faithful state. If $varphi:Arightarrow A$ is a unital linear map which is bijective and invertibility preserving or surjective and spectral radius preserving, then $varphi$ is a Jordan isomorphism. Also, we discuss other types of linear preserver maps on $A$.
متن کاملApproximation of the joint spectral radius using sum of squares
We provide an asymptotically tight, computationally efficient approximation of the joint spectral radius of a set of matrices using sum of squares (SOS) programming. The approach is based on a search for an SOS polynomial that proves simultaneous contractibility of a finite set of matrices. We provide a bound on the quality of the approximation that unifies several earlier results and is indepe...
متن کاملNew upper bounds on the spectral radius of unicyclic graphs
Let G = (V (G), E(G)) be a unicyclic simple undirected graph with largest vertex degree . Let Cr be the unique cycle of G. The graph G− E(Cr ) is a forest of r rooted trees T1,T2, . . .,Tr with root vertices v1, v2, . . ., vr , respectively. Let k(G) = max 1 i r {max{dist(vi , u) : u ∈ V (Ti )}} + 1, where dist(v, u) is the distance from v to u. Let μ1(G) and λ1(G) be the spectral radius of the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Linear Algebra
سال: 2022
ISSN: ['1081-3810', '1537-9582']
DOI: https://doi.org/10.13001/ela.2022.6981